m-Convex Functions of Higher Order

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inequalities for discrete higher order convex functions

[1] E. BOROS AND A. PRÉKOPA, Closed Form Two-Sided Bounds for Probabilities That Exactly r and at Least r out of n Events Occur, Mathematics of Operations Research, 14 (1989), 317–342. [2] D. DAWSON AND A. SANKOFF, An Inequality for Probabilities, Proceedings of the American Mathematical Society, 18 (1967), 504–507. [3] H.P. EDMUNDSON, Bounds on the Expectation of a Convex Function of a Random ...

متن کامل

Higher order close-to-convex functions associated with Attiya-Srivastava operator

In this paper‎, ‎we introduce a new class$T_{k}^{s,a}[A,B,alpha‎ ,‎beta ]$ of analytic functions by using a‎ ‎newly defined convolution operator‎. ‎This class contains many known classes of‎ ‎analytic and univalent functions as special cases‎. ‎We derived some‎ ‎interesting results including inclusion relationships‎, ‎a radius problem and‎ ‎sharp coefficient bound for this class‎.

متن کامل

higher order close-to-convex functions associated with attiya-srivastava operator

in this paper‎, ‎we introduce a new class$t_{k}^{s,a}[a,b,alpha‎ ,‎beta ]$ of analytic functions by using a‎ ‎newly defined convolution operator‎. ‎this class contains many known classes of‎ ‎analytic and univalent functions as special cases‎. ‎we derived some‎ ‎interesting results including inclusion relationships‎, ‎a radius problem and‎ ‎sharp coefficient bound for this class‎.

متن کامل

L-convex Functions and M-convex Functions

In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...

متن کامل

Higher Order Spt-functions

Andrews’ spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Mathematicae Silesianae

سال: 2019

ISSN: 2391-4238,0860-2107

DOI: 10.2478/amsil-2019-0013